Standard Paths in the Composition Poset
نویسندگان
چکیده
We study different problems of enumeration of standard paths in the poset of compositions of integers. We show that several problems similar to those considered in the poset of partitions of integers become simpler in this context. We give explicit formulas for generating functions of standard paths in this poset and interesting subposets, and a closed formula for the number of standard paths ending at a given composition.
منابع مشابه
Saturated chains in composition posets
We study some poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset N was studied by the author in [5] in relation to non-commutative term orders, and then in [6], where some results about generating functions for standard path...
متن کاملStandard Paths in Another Composition Poset
Bergeron, Bousquet-Mélou and Dulucq [1] enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition μ covers another composition λ if μ can be obtained from λ by adding 1 to one of the parts of λ, or by inserting a part of size 1 into λ. We employ the methods they developed in order to study the same problem for the following p...
متن کاملThe Dyck pattern poset
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...
متن کاملPattern - avoiding Dyck paths †
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the Dyck pattern poset. Given a Dyck path P , we determine a formula for the number of Dyck paths covered by P , as well as for the ...
متن کاملThe m - Cover Posets and the Strip - Decomposition of m - Dyck Paths ( Extended
In the first part of this article we present a realization of the m-Tamari lattice T (m) n in terms of m-tuples of Dyck paths of height n, equipped with componentwise rotation order. For that, we define the m-cover poset P〈m〉 of an arbitrary bounded poset P , and show that the smallest lattice completion of the m-cover poset of the Tamari lattice Tn is isomorphic to the m-Tamari lattice T (m) n...
متن کامل